On interreduction of semi-complete term rewriting systems
نویسندگان
چکیده
منابع مشابه
On interreduction of semi-complete term rewriting systems
For a complete, i.e., connuent and terminating term rewriting system (TRS) it is well-known that simpliication (also called interreduction) into an equivalent canonical, i.e., complete and interreduced TRS is easily possible. This can be achieved by rst normalizing all right-hand sides of the TRS and then deleting all rules with a reducible left-hand side. Here we investigate the logical and op...
متن کاملOn Semi-Completeness of Term Rewriting Systems
We investigate the question whether semi-completeness, i.e., weak termination plus connuence, of term rewriting systems is preserved under the normalization of right-hand sides. We give a simple counterexample showing that in general this transformation neither preserves weak termination nor (local) connuence. Moreover we present two conditions which are suucient for the preservation of semi-co...
متن کاملPersistence of Semi-Completeness for Term Rewriting Systems
A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that weak normalization is persistent for term rewriting systems. Furthermore we obtain that semi-completeness is persistent for term rewriting systems and we give the exampl...
متن کاملComplete involutive rewriting systems
Given a monoid string rewriting system M , one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is well known that this algorithm is equivalent to computing a noncommutative Gröbner basis for M . This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involuti...
متن کاملOn Composable Properties of Term Rewriting Systems
A property of term rewriting system (TRS, for short) is said to be composable if it is preserved under unions. We present composable properties of TRSs on the base of modularity results for direct sums of TRSs. We propose a decomposition by a naive sort attachment, and show that modular properties for direct sums of TRSs are -composable for a naive sort attachment . Here, a decomposition of a T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00030-x